Traffic assignment problem for footpath networks with bidirectional links

نویسندگان

چکیده

The estimation of pedestrian traffic in urban areas is often performed with computationally intensive microscopic models that usually suffer from scalability issues large-scale footpath networks. In this study, we present a new macroscopic user equilibrium assignment problem (UE-pTAP) framework for networks while taking into account fundamental properties such as self-organization bidirectional streams and stochastic walking travel times. We propose four different types volume-delay functions (pVDFs), calibrate them empirical data, discuss their implications on the existence uniqueness solution. demonstrate applicability developed UE-pTAP small network well large scale Sydney footpaths.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust bidirectional links for photonic quantum networks

Optical fibers are widely used as one of the main tools for transmitting not only classical but also quantum information. We propose and report an experimental realization of a promising method for creating robust bidirectional quantum communication links through paired optical polarization-maintaining fibers. Many limitations of existing protocols can be avoided with the proposed method. In pa...

متن کامل

Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem

The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the develop...

متن کامل

Efficient Traffic Assignment for Public Transit Networks

We study the problem of computing traffic assignments for public transit networks: Given a public transit network and a demand (i.e. a list of passengers, each with associated origin, destination, and departure time), the objective is to compute the utilization of every vehicle. Efficient assignment algorithms are a core component of many urban traffic planning tools. In this work, we present a...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

/ the Multi - Modal Traffic Assignment Problem

Traffic equilibrium analysis 4~s provided useful insight into the transportation planning proce~s. Even for deterministic demand models, though, the state-of-the-art does not include any efficient approach that is applicable for general equilibrium models. Existing convex programming approaches, which are efficient and guarantee convergence, are restrj.cted to single commodity (mode, user class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part C-emerging Technologies

سال: 2022

ISSN: ['1879-2359', '0968-090X']

DOI: https://doi.org/10.1016/j.trc.2022.103905